An algebraic approach to data languages and timed languages
نویسندگان
چکیده
منابع مشابه
An algebraic approach to data languages and timed languages
Algebra offers an elegant and powerful approach to understand regular languages and finite automata. Such framework has been notoriously lacking for timed languages and timed automata. We introduce the notion of monoid recognizability for data languages, which include timed languages as special case, in a way that respects the spirit of the classical situation. We study closure properties and h...
متن کاملAn Algebraic Characterization of Data and Timed Languages
Algebra offers an elegant and powerful approach to understand regular languages and finite automata. Such framework has been notoriously lacking for timed languages and timed automata. We introduce the notion of monoid recognizability for data languages, which include timed languages as special case, in a way that respects the spirit of the classical situation. We study closure properties and h...
متن کاملAn Algebraic Approach to Semantics of Programming Languages
An abstract language for a computer of van Neumann type is presented. This language is considered not only as a programming language, but as an algebraic one, whose semantics is defined by methods of model theory. Calculus of equivalencies of the abstract programs and techniques for solving equations within limits of this calculus are presented. An algebraic technique is described which allows ...
متن کاملAn Approach to Algebraic Semantics of Object-Oriented Languages
Studying the semantics of programming languages has a long tradition in computer science. Various approaches use various formalisms with various objectives. In the last two decades, algebraic specifications have frequently been used to study functional as well as imperative languages, and, in particular, object-orientated ones, thereby often focusing on specific aspects and concepts of this pro...
متن کاملExpressiveness of Timed Events and Timed Languages
Timed process algebras are useful tools for the specification and verification of real-time systems. We study the expressiveness of (classes of) these algebras which deal with temporal aspects of concurrent systems by following very different interpretations: durational actions versus durationless actions, absolute time versus relative time, timed functional behavior versus time and functional ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2003
ISSN: 0890-5401
DOI: 10.1016/s0890-5401(03)00038-5